منابع مشابه
Calculation of Gauss Quadrature Rules
Several algorithms are given and compared for computing Gauss quadrature rules. It is shown that given the three term recurrence relation for the orthogonal polynomials generated by the weight function, the quadrature rule may be generated by computing the eigenvalues and first component of the orthornormalized eigenvectors of a symmetric tridiagonal matrix. An algorithm is also presented for c...
متن کاملCalculation of Gauss-Kronrod quadrature rules
The Jacobi matrix of the (2n+1)-point Gauss-Kronrod quadrature rule for a given measure is calculated efficiently by a five-term recurrence relation. The algorithm uses only rational operations and is therefore also useful for obtaining the Jacobi-Kronrod matrix analytically. The nodes and weights can then be computed directly by standard software for Gaussian quadrature formulas.
متن کاملGeneralized anti-Gauss quadrature rules
Abstract. Gauss quadrature is a popular approach to approximate the value of a desired integral determined by a measure with support on the real axis. Laurie proposed an (n+1)-point quadrature rule that gives an error of the same magnitude and of opposite sign as the associated n-point Gauss quadrature rule for all polynomials of degree up to 2n + 1. This rule is referred to as an anti-Gauss ru...
متن کاملHybrid Gauss-Trapezoidal Quadrature Rules
A new class of quadrature rules for the integration of both regular and singular functions is constructed and analyzed. For each rule the quadrature weights are positive and the class includes rules of arbitrarily high-order convergence. The quadratures result from alterations to the trapezoidal rule, in which a small number of nodes and weights at the ends of the integration interval are repla...
متن کاملComputation of Gauss-Kronrod quadrature rules
Recently Laurie presented a new algorithm for the computation of (2n+1)-point Gauss-Kronrod quadrature rules with real nodes and positive weights. This algorithm first determines a symmetric tridiagonal matrix of order 2n+ 1 from certain mixed moments, and then computes a partial spectral factorization. We describe a new algorithm that does not require the entries of the tridiagonal matrix to b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1969
ISSN: 0025-5718
DOI: 10.2307/2004418